Largest component of subcritical random graphs with given degree sequence
نویسندگان
چکیده
We study the size of largest component two models random graphs with prescribed degree sequence, configuration model (CM) and uniform (UM), in (barely) subcritical regime. For CM, we give upper bounds that are asymptotically tight for certain sequences. These hold under mild conditions on sequence improve previous results Hatami Molloy barely UM, weaker up to logarithmic terms but require no assumptions sequence. In particular, latter result applies sequences infinite variance
منابع مشابه
Random graphs with a given degree sequence
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lovász and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. ...
متن کاملThe Largest Component in Subcritical Inhomogeneous Random Graphs
as was introduced by Bollobás, Janson and Riordan in [1]. Here S is a separable metric space and μ is a Borel probability measure on S . No relationship is assumed between x (n) i and x (n′) i . To simplify notation we shall from now on write (x1, . . . , xn) = (x (n) 1 , . . . , x (n) n ). We begin by recalling some basic definitions and assumptions from [1]. For each n let (x1, . . . , xn) be...
متن کاملInduced subgraphs in sparse random graphs with given degree sequence
Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...
متن کاملPercolation on sparse random graphs with given degree sequence
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards we focus on site percolation where the vertices are retained with probability p. We establish critical values for p above which a giant component emerges in...
متن کاملOn the Largest Component of a Random Graph with a Subpower-law Degree Sequence in a Subcritical Phase
A uniformly random graph on n vertices with a fixed degree sequence, obeying a γ subpower law, is studied. It is shown that, for γ > 3, in a subcritical phase with high probability the largest component size does not exceed nn , εn =O(ln lnn/ lnn), 1/γ being the best power for this random graph. This is similar to the best possible n bound for a different model of the random graph, one with ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2023
ISSN: ['1083-6489']
DOI: https://doi.org/10.1214/23-ejp921